Transparency Order and Cross-Correlation Analysis of Boolean Functions
نویسندگان
چکیده
Transparency order is considered to be a cryptographically significant property that characterizes the resistance of S-boxes in opposition differential power analysis attacks. The S-box having low transparency more resistant these Until now, little attempts have been noticed examine theoretically and its relationship with other cryptographic properties. All constructions associated are relying on search algorithms. In this paper, we discuss new interpretation bent functions terms their order. Using concept vector concatenation correlation characteristics, find Boolean functions. notion complementary given. For pair functions, interpret by Walsh-Hadamard transform. We establish cross-correlation for −variable decomposition generalize bounds sum-of-squares autocorrelation using spectra. Further function fulfilling propagation criterion about linear subspace evaluated.
منابع مشابه
Generalized Correlation Analysis of Vectorial Boolean Functions
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean functions. However, as shown by Zhang and Chan at Crypto 2000, linear approximations based on composing the vector output with any Boolean functions have higher bias than those based on the usual correlation attack. In...
متن کاملAnalysis of boolean functions with high second order nonlinearity
Highly nonlinear Boolean functions play a central role in the design and security analysis of high speed stream cyphers and block cyphers. We focus on analyzing the structure of Boolean functions that exhibit high second order nonlinearity. We commence with a theoretical overview of Boolean functions and ReedMuller codes. We then introduce a new equivalence relation, 2-equivalence, for which we...
متن کاملConstruction of correlation immune Boolean functions
It is shown in this paper that every correlation immune Boolean function of n variables can be written as f(x) = g(xG ), where 9 is an algebraic non-degenerate Boolean function of k (k :::; n) variables and G is a generating matrix of an tn, k, d] linear code. In this expression the correlation immunity of f(x) must be at least d 1. In this paper we further prove when the correlation immunity e...
متن کاملAnalysis of Boolean Functions
Scribe notes from the 2012 Barbados Workshop on Computational Complexity. A series of lectures on Analysis of Boolean Functions by Ryan O'Donnell, with a guest lecture by Per Austrin.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics and Statistics
سال: 2022
ISSN: ['2332-2144', '2332-2071']
DOI: https://doi.org/10.13189/ms.2022.100618